The Vertex-Distinguishing Edge Coloring of 𝑷𝒎⋁𝑲𝒏 and 𝑪𝒎 ∨ 𝑲𝒏
نویسندگان
چکیده
منابع مشابه
Adjacent vertex-distinguishing edge coloring of graphs
An adjacent vertex-distinguishing edge coloring, or avd-coloring, of a graph G is a proper edge coloring of G such that no pair of adjacent vertices meets the same set of colors. Let mad(G) and ∆(G) denote the maximum average degree and the maximum degree of a graph G, respectively. In this paper, we prove that every graph G with ∆(G) ≥ 5 and mad(G) < 3− 2 ∆ can be avd-colored with ∆(G) + 1 col...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملadjacent vertex distinguishing acyclic edge coloring of the cartesian product of graphs
let $g$ be a graph and $chi^{prime}_{aa}(g)$ denotes the minimum number of colors required for an acyclic edge coloring of $g$ in which no two adjacent vertices are incident to edges colored with the same set of colors. we prove a general bound for $chi^{prime}_{aa}(gsquare h)$ for any two graphs $g$ and $h$. we also determine exact value of this parameter for the cartesian product of ...
متن کاملA Vizing-like theorem for union vertex-distinguishing edge coloring
A vertex-distinguishing coloring of a graph G consists in an edge or a vertex coloring (not necessarily proper) of G leading to a labeling of the vertices of G, where all the vertices are distinguished by their labels. There are several possible rules for both the coloring and the labeling. For instance, in a set irregular edge coloring [5], the label of a vertex is the union of the colors of i...
متن کاملAdjacent Vertex Distinguishing Edge-Colorings
An adjacent vertex distinguishing edge-coloring of a simple graph G is a proper edge-coloring of G such that no pair of adjacent vertices meets the same set of colors. The minimum number of colors χa(G) required to give G an adjacent vertex distinguishing coloring is studied for graphs with no isolated edge. We prove χa(G) ≤ 5 for such graphs with maximum degree Δ(G) = 3 and prove χa(G) ≤ Δ(G) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Engineering and Technology Research
سال: 2017
ISSN: 2475-885X
DOI: 10.12783/dtetr/icamm2016/7350